Logically and Physically Reversible Natural Computing: A Tutorial
نویسنده
چکیده
This year marks the 40 anniversary of Charles Bennett’s seminal paper on reversible computing. Bennett’s contribution is remembered as one of the first to demonstrate how any deterministic computation can be simulated by a logically reversible Turing machine. Perhaps less remembered is that the same paper suggests the use of nucleic acids to realise physical reversibility. In context, Bennett’s foresight predates Leonard Adleman’s famous experiments to solve instances of the Hamiltonian path problem using strands of DNA — a landmark date for the field of natural computing — by more than twenty years. The ensuing time has seen active research in both reversible computing and natural computing that has been, for the most part, unrelated. Encouraged by new, experimentally viable DNA computing models, there is a resurgent interest in logically reversible computing by the natural computing community. We survey these recent results, and their underlying ideas, which demonstrate the potential for logically and physically reversible computation using nucleic acids.
منابع مشابه
Reversible logic gate using adiabatic superconducting devices
Reversible computing has been studied since Rolf Landauer advanced the argument that has come to be known as Landauer's principle. This principle states that there is no minimum energy dissipation for logic operations in reversible computing, because it is not accompanied by reductions in information entropy. However, until now, no practical reversible logic gates have been demonstrated. One of...
متن کاملNondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal
In the investigation of minimal machinery in reversible computing, we proved that each nondegenerate 2-state 3-symbol reversible logic element is logically universal. So far, a 2-state 4-symbol element called “rotary element” was shown to be logically universal in the framework of reversible logic element with memory. The main result in this paper not only improves the previous result with resp...
متن کاملLogical Reversibility and Physical Reversibility in Quantum Measurement
A quantum measurement is logically reversible if the premeasurement density operator of the measured system can be calculated from the postmeasurement density operator and from the outcome of the measurement. This paper analyzes why many quantum measurements are logically irreversible, shows how to make them logically reversible, and discusses reversing measurement that returns the postmeasurem...
متن کاملIsomorphic Interpreters from Logically Reversible Abstract Machines
In our previous work, we developed a reversible programming language and established that every computation in it is a (partial) isomorphism that is reversible and that preserves information. The language is founded on type isomorphisms that have a clear categorical semantics but that are awkward as a notation for writing actual programs, especially recursive ones. This paper remedies this aspe...
متن کاملReversible computer engineering and architecture
There exists a set of reversible primitive modules that may be combined according to a set of simple rules to create larger systems, which are themselves reversible primitive modules. These modules may be combined to create a fully reversible, universal computer. I describe techniques for creating reversible primitive modules from simple switches, such as conventional CMOS transistors, and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013